Computing Error Distance of Reed-Solomon Codes
نویسندگان
چکیده
Under polynomial time reduction, the maximun likelihood decoding of a linear code is equivalent to computing the error distance of a received word. It is known that the decoding complexity of standard Reed-Solomon codes at certain radius is at least as hard as the discrete logarithm problem over certain large finite fields. This implies that computing the error distance is hard for standard Reed-Solomon codes. Using the Weil bound and a new sieve for distinct coordinates counting, we are able to compute the error distance for a large class of received words. This significantly improves previous results in this direction. As a corollary, we also improve the existing results on the Cheng-Murray conjecture about the complete classification of deep holes for standard Reed-Solomon codes.
منابع مشابه
Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks
In this work we investigate and compare bounds on throughput and delay performance of code-based scheduling protocols derived from the codewords of Reed-Solomon and Hermitian codes. It is found that Hermitian codes outperform Reed-Solomon codes in minimum throughput guarantee and delay metrics when the number of nodes is in the order of thousands. The relative minimum distance of a code is iden...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملSoft-decision Decoding of Reed-solomon Codes Using Pattern Information over Partial Response Channels
Reed-Solomon (RS) codes have been used for a long time in many data storage systems for error correction. Popularity of RS codes is due to their powerful burst error correction capability and well-established decoding algorithm with efficient hardware implementation providing high throughput. Conventional hard-decision decoding algorithms are able to correct up to half the minimum distance. To ...
متن کاملOn the Multiuser Error Probability and the Maximum Likelihood Performance of MDS Codes
MDS (e.g. Reed-Solomon) codes have many desirable properties which make them the code of choice in network scenarios and distributed coding schemes. An average binary weight enumerator of Reed-Solomon (RS) codes is derived assuming a binomial distribution of the bits in a non-zero symbol. Lower bounds on the average binary minimum distance of the ensemble of binary images of a Reed-Solomon code...
متن کاملSkew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such dist...
متن کامل